Recursive algorithm for parity games requires exponential time
نویسندگان
چکیده
منابع مشابه
Recursive algorithm for parity games requires exponential time
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.
متن کاملRecursive Solving Of Parity Games Requires Exponential Time
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.
متن کاملThe Stevens-Stirling-Algorithm for Solving Parity Games Locally Requires Exponential Time
Parity games are simple two-player games of perfect information played on directed graphs whose nodes are labeled with natural numbers, called priorities. A play in a parity game is an infinite sequence of nodes whose winner is determined by the highest priority occurring infinitely often. Parity games have various applications in computer science, e.g. as algorithmic back end to the model chec...
متن کاملLinear Time Algorithm for Weak Parity Games
We consider games played on graphs with the winning conditions for the players specified as weak-parity conditions. In weak-parity conditions the winner of a play is decided by looking into the set of states appearing in the play, rather than the set of states appearing infinitely often in the play. A naive analysis of the classical algorithm for weak-parity games yields a quadratic time algori...
متن کاملParallel Parity Games: a Multicore Attractor for the Zielonka Recursive Algorithm
Parity games are abstract infinite-duration two-player games, widely studied in computer science. Several solution algorithms have been proposed and also implemented in the community tool of choice called PGSolver, which has declared the Zielonka Recursive (ZR) algorithm the best performing on randomly generated games. With the aim of scaling and solving wider classes of parity games, several i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2011
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2011124